greedy algorithm造句
例句與造句
- It is, of course, very easy to improve the efficiency of the greedy algorithm .
當(dāng)然,貪婪算法的有效性是很容易改進(jìn)的。 - A modified greedy algorithm for ldpc encoder implementation
編碼中貪婪算法的改進(jìn) - Greedy algorithm for besov classes
類(lèi)上的貪婪算法 - Combined with the two greedy algorithms , we also give a combinative - choice greedy algorithm
并且,結(jié)合這兩種貪婪算法,我們還提出一個(gè)混合貪婪算法。 - At the same time , a greedy algorithm is used to eliminate the crossing - conflicts between translation boundaries of source language phrases
同時(shí)利用貪心算法消除源語(yǔ)言短語(yǔ)譯文邊界之間的交叉沖突。 - It's difficult to find greedy algorithm in a sentence. 用greedy algorithm造句挺難的
- There are some numerical examples to show that the greedy algorithms work well . finally , we consider the numerical rank lrms
這些貪婪算法(特別是向后貪婪算法和混合貪婪算法)都能夠很好的得到所需的最優(yōu)子矩陣。 - Based on analyzing the mathematical models for one - dimensional cutting stock problem , a greedy algorithm has been constructed , which is an approximate algorithm
摘要在對(duì)一維下料方案數(shù)學(xué)模型分析的基礎(chǔ)上,提出了一種基于貪心算法的求解方法。 - A greedy algorithm for aligning dna sequence . jounal of computational biology , 2000 , 7 12 , 1 2 : 203 - 214 . 9 singh r k , dettloff w d , chi v l et al
基于這一體系結(jié)構(gòu)特點(diǎn),本文對(duì)megablast程序的流程進(jìn)行了優(yōu)化,采用對(duì)庫(kù)造表的策略,實(shí)現(xiàn)了計(jì)算和輸出的重疊。 - A feature refreshing method during tracking is studied . greedy algorithm is used to compensate non - affine deformation caused by the changes of view and target ' s movement
用貪心算法對(duì)使用仿射模型跟蹤時(shí),由于目標(biāo)運(yùn)動(dòng)和視角變化而產(chǎn)生的非仿射變形進(jìn)行補(bǔ)償。 - Finally , the solution of minimizing the energy function was obtained by using the modified greedy algorithm , after which , the precise contour of the object was extracted
用改進(jìn)的貪婪算法求得能量函數(shù)最小值,提取出運(yùn)動(dòng)目標(biāo)的精確輪廓,從而得到具有精確邊緣的運(yùn)動(dòng)目標(biāo)。 - The ga is an efficient one can find a better result when the scale of this problem is small and the greedy algorithm performs better when the scale of this problem is larger
最后,通過(guò)對(duì)多星區(qū)域觀測(cè)效率優(yōu)化工具及兩個(gè)具體的實(shí)例進(jìn)行研究,在實(shí)踐上驗(yàn)證了模型及算法的有效性。 - As the basis of studying detector generation in eds , several new algorithms are presented . inspired by evolution computing , the thesis firstly analyzes rcb template and rcb greedy algorithm
借鑒進(jìn)化計(jì)算的成果,提出檢測(cè)器集生成的rcb模板法和rcb貪婪法,并討論了遺傳算法在檢測(cè)器集生成中的應(yīng)用。 - Aimed at the 0 - 1 knapsack problems , the article proposes a kind of hybrid intelligence algorithm combining with the adjusting strategy , the greedy algorithm and the binary particle swarm optimization algorithm
摘要針對(duì)0 - 1背包問(wèn)題,提出一種具有修復(fù)策略的、貪心算法與二進(jìn)制粒子群算法相結(jié)合的混合智能算法。 - 3 . the theory of the active contour method is introduced systematically , and an improvement of energy function is presented . the experiments with the greedy algorithm give a good result
3 .系統(tǒng)介紹了主動(dòng)輪廓線(xiàn)( snake )方法原理和當(dāng)前的發(fā)展?fàn)顩r,在此基礎(chǔ)上對(duì)能量函數(shù)進(jìn)行了改進(jìn),并與貪婪算法相結(jié)合,實(shí)驗(yàn)效果良好。 - We also have the backward - choice greedy algorithm : if j is the column index subset which we have known , then we choose a column index j " from the subset j , such that which k is the rank of a ( : , j )
貪婪算法的思想是:每次“最貪婪的”從剩下的子矩陣中選擇一列添加到已知的子矩陣中,或“最貪婪的”從已知的子矩陣中消去一列。
更多例句: 下一頁(yè)